# -*- coding: UTF-8 -*-
import heapq
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def kWeakestRows(self, mat: List[List[int]], k: int) -> List[int]:
        def binary_search_right(nums: List[int], target: int) -> int:
            left = 0
            right = len(nums) - 1

            while left <= right:
                mid = left + (right - left) // 2
                mid_value = nums[mid]

                if target == mid_value:
                    left = mid + 1
                elif target > mid_value:
                    right = mid - 1
                else:
                    left = mid + 1

            return left

        # 利用heapq创建一个小根堆
        h = []

        # 遍历矩阵，利用二分法来得到军人数量
        for i in range(len(mat)):
            row = mat[i]
            solder_count = binary_search_right(row, 1)
            heapq.heappush(h, (solder_count, i))

        count = k
        ans = []
        while count > 0:
            solder_count, row = heapq.heappop(h)
            ans.append(row)
            count -= 1

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([[1, 1, 0, 0, 0],
          [1, 1, 1, 1, 0],
          [1, 0, 0, 0, 0],
          [1, 1, 0, 0, 0],
          [1, 1, 1, 1, 1]], 3, [2, 0, 3]),
        ([[1, 0, 0, 0],
         [1, 1, 1, 1],
         [1, 0, 0, 0],
         [1, 0, 0, 0]], 2, [0, 2]
        )
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.kWeakestRows(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

